Explicit Computational Paths in Type Theory
نویسندگان
چکیده
منابع مشابه
Computational semantics in type theory
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm i...
متن کاملOn the Use of Computational Paths in Path Spaces of Homotopy Type Theory
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as ‘identity type’. The idea is that, given terms a, b of a type A, one may form the type IdA(a, b), whose elements are proofs that a and b are equal elements of type A. A term of this type, p : IdA(a, b), makes up for the grounds (or proof) that establishes that a is indeed equal to b...
متن کاملOn the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths
One of the most interesting entities of homotopy type theory is the identity type. It gives rise to an interesting interpretation of the equality, since one can semantically interpret the equality between two terms of the same type as a collection of homotopical paths between points of the same space. Since this is only a semantical interpretation, the addition of paths to the syntax of homotop...
متن کاملGuarded Computational Type Theory
We develop a computational interpretation of guarded dependent type theory with clocks called CTT which enjoys a straightforward operational semantics and immediate canonicity result for base types. Our realizability-style presentation of guarded type theory is a computational and syntactic alternative to category-theoretic accounts of guarded recursion, emphasizing type theory’s role as the ul...
متن کاملComputational type theory
Computational type theory provides answers to questions such as: What is a type? What is a natural number? How do we compute with types? How are types related to sets? Can types be elements of types? How are data types for numbers, lists, trees, graphs, etc. related to the corresponding notions in mathematics? What is a real number? Are the integers a subtype of the reals? Can we form the type ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2019
ISSN: 1079-8986,1943-5894
DOI: 10.1017/bsl.2019.2